Language and Computation - PDFSEARCH.IO - Document Search Engine

Language and Computation
Results: 343

#	Item
21	To appear in A. Gupta and J. van Benthem (eds.), Logic and Philosophy Today, College Publications, Logic and Social Choice Theory Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Add to Reading List Source URL: staff.fnwi.uva.nl - Date: 2012-01-09 08:18:25
22	To appear in Procedia Computer ScienceComputational Social Choice: Prospects and Challenges1 Ulle Endriss Institute for Logic, Language and Computation (ILLC), University of Amsterdam Postbus 94242, 1090 GE Amst Add to Reading List Source URL: staff.fnwi.uva.nl - Date: 2012-01-09 07:02:24
23	Comparing strengths of beliefs explicitly Dick de Jongh Sujata Ghosh Institute for Logic, Language and Computation Add to Reading List Source URL: ceur-ws.org - Date: 2009-08-10 08:38:06
24	Games for Learning A Sabotage Approach Nina Gierasimczuk, Lena Kurzen and Fernando R. Vel´azquez-Quesada Institute for Logic, Language and Computation Universiteit van Amsterdam Email: {N.Gierasimczuk \| L.M.Kurzen \| F.R Add to Reading List Source URL: ceur-ws.org - Date: 2009-08-10 08:38:58
25	Correspondence and Canonicity in Non-Classical Logic Sumit Sourabh INSTITUTE FOR LOGIC LANGUAGE AND COMPUTATION Correspondence and Canonicity Add to Reading List Source URL: www.illc.uva.nl - Date: 2015-10-29 12:05:22
26	The Language and Computation Group Research Activities Tonight Add to Reading List Source URL: www.essex.ac.uk - Date: 2009-10-15 11:18:32
27	Surprisal-based comparison between a symbolic and a connectionist model of sentence processing Stefan L. Frank () Institute for Logic, Language and Computation University of Amsterdam Science Park 904, 10 Add to Reading List Source URL: www.stefanfrank.info - Date: 2012-03-11 05:05:07
28	On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing Add to Reading List Source URL: korrekt.org Language: English - Date: 2016-06-13 07:14:39 Computational complexity theory Finite automata Complexity classes Theory of computation Nondeterministic finite automaton Regular language PSPACE Bchi automaton FO Permutation IP Structure
29	7KH)LIWK,QWHUQDWLRQDO:RUNVKRSRQ(YDOXDWLQJ,QIRUPDWLRQ$FFHVV(9,$-XQH7RN\R-DSDQ Nugget-Based Computation of Graded Relevance Charles L. A. Clarke Computer Science, University of Waterloo, Canada Add to Reading List Source URL: plg.uwaterloo.ca Language: English - Date: 2013-05-26 20:43:50 Information science Information retrieval Information retrieval evaluation Natural language processing Relevance Precision and recall Ranking Relevance feedback
30	Revisiting: Algebraic laws for nondeterminism and concurrency Matthew Hennessy Milner-Symposium, Edinburgh Add to Reading List Source URL: events.inf.ed.ac.uk Language: English - Date: 2012-10-10 03:52:01 Theoretical computer science Logic in computer science Formal methods Programming language semantics Models of computation Denotational semantics Process calculi Matthew Hennessy Semantics Maurice Nivat Bisimulation Negation

UPDATE